Bivariate affine Gončarov polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bivariate affine Gončarov polynomials

Bivariate Gončarov polynomials are a basis of the solutions of the bivariate Gončarov Interpolation Problem in numerical analysis. A sequence of bivariate Gončarov polynomials is determined by a set of nodes Z = {(xi,j, yi,j) ∈ R2} and is an affine sequence if Z is an affine transformation of the lattice grid N2, i.e., (xi,j, yi,j) = A(i, j)T + (c1, c2) for some 2 × 2 matrix A and constants c1,...

متن کامل

Generalized Gončarov Polynomials

We introduce the sequence of generalized Gončarov polynomials, which is a basis for the solutions to the Gončarov interpolation problem with respect to a delta operator. Explicitly, a generalized Gončarov basis is a sequence (tn(x))n≥0 of polynomials defined by the biorthogonality relation εzi(d (tn(x))) = n!δi,n for all i, n ∈ N, where d is a delta operator, Z = (zi)i≥0 a sequence of scalars, ...

متن کامل

Generalized Bivariate Fibonacci Polynomials

We define generalized bivariate polynomials, from which specifying initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in most cases generalize known results. 1 Antefacts The generalized bivariate Fibonacci polynomial may be defined as Hn(x, y) = xHn−1(x, y) + yHn−2(x, y), H0(x, y) = a0, H1...

متن کامل

The Bivariate Rogers-Szegö Polynomials

We obtain Mehler’s formula and the Rogers formula for the continuous big qHermite polynomials Hn(x; a|q). Instead of working with the polynomials Hn(x; a|q) directly, we consider the equivalent forms in terms of the bivariate Rogers-Szegö polynomials hn(x, y|q) recently introduced by Chen, Fu and Zhang. It turns out that Mehler’s formula for Hn(x; a|q) involves a 3φ2 sum, and the Rogers formula...

متن کامل

Factorizations of Certain Bivariate Polynomials

We determine the factorization of Xf(X) − Y g(Y ) over K[X, Y ] for all squarefree additive polynomials f, g ∈ K[X] and all fields K of odd characteristic. This answers a question of Kaloyan Slavov, who needed these factorizations in connection with an algebraic-geometric analogue of the Kakeya problem.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2016

ISSN: 0012-365X

DOI: 10.1016/j.disc.2016.03.027